Embedding ASMs into State Transition Diagrams
نویسندگان
چکیده
منابع مشابه
An ASM Semantics for UML Activity Diagrams
We provide a rigorous semantics for one of the central diagram types which are used in UML for the description of dynamical system behavior, namely activity diagrams. We resolve for these diagrams some of the ambiguities which arise from different interpretations of UML models. Since we phrase our definition in terms of Abstract State Machines, we define at the same time an interesting subclass...
متن کاملManagement of UML Clusters
Software engineering uses UML diagrams as a standard technique for specification and development of software. Various UML diagrams are used for specification of different aspects of the application. Their interpretation, extension, revision and integration becomes awful difficult if developers use the full freedom of UML, apply their own semantics and do not agree an common parts. We propose an...
متن کاملSemantic foundation and tool support for model-driven development with UML 2 activity diagrams
State Machines An Abstract State Machine (ASM) is used to formally define the behavior of a system. The level of abstraction can be chosen freely. We will use ASMs to define the semantics of UML 2 activity diagrams in chapter 5. Here, we give a short overview of ASMs and introduce keywords that are relevant in our context. ASMs were introduced by Gurevich [Gur94]. A comprehensive introduction a...
متن کاملASM refinement and generalizations of forward simulation in data refinement: a comparison
In [1], we have formalized Börger’s refinement notion for Abstract State Machines (ASMs). The formalization was based on transition systems, and verification conditions were expressed in Dynamic Logic. In this paper, the relation between ASM refinement and data refinement is explored. Data refinement expresses operations and verification conditions using relational calculus. We show how to brid...
متن کاملA Practical Course on KIV
State Machines and ASM refinement Abstract State Machines (ASMs) are a formalism to model algorithms in a simple, but formally defined way. ASMs originally were the result of theoretical research into the foundations of computation: The idea was to sharpen the thesis by Church and Turing, which says that all definitions of “algorithm” are equivalent (and equivalent to the computations of a Turi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000